Introducing mass balancing theorem for network flow maximization
نویسندگان
چکیده
منابع مشابه
Introducing Simplex Mass Balancing Method for Multi-commodity Flow Network with a Separator
Maximization of flow through the network has remained core issue in the field of optimization. In this paper a new advanced network problem is introduced, i.e., a multi-commodity network with a separator. This network consists of several sub-networks linked through a commodity separator. The objective is to maximize the flow of the commodity of interest from the commodity mixture at the output ...
متن کاملBalancing Applied to Maximum Network Flow
We explore balancing as a definitional and algorithmic tool for finding minimum cuts and maximum flows in ordinary and parametric networks. We show that a standard monotonic parametric maximum flow problem can be formulated as a problem of computing a particular maximum flow that is balanced in an appropriate sense. We present a divide-and-conquer algorithm to compute such a balanced flow in a ...
متن کاملA Mass Conservative Method for Numerical Modeling of Axisymmetric flow
In this paper, the cell-centered finite volume method (CC-FVM) has been presented to simulate the axisymmetric radial flow toward a pumping well. The model is applied to the unstructured triangular grids which allows to simulate inhomogeneous and complex-shaped domains. Due to the non-orthogonality of the irregular grids, the multipoint flux approximation (MPFA) methods are used to discretize t...
متن کاملThe dual network theorem for static flow networks and its application for maximising the throughput flow
The paper discuses a new fundamental result in the theory of flow networks referred to as the ‘dual network theorem for static flow networks’. The theorem states that the maximum throughput flow in any static network is equal to the sum of the capacities of the edges coming out of the source, minus the total excess flow at all excess nodes, plus the maximum throughput flow in the dual network. ...
متن کاملStrongly polynomial algorithm for generalized flow maximization
A strongly polynomial algorithm is given for the generalized flow maximization problem. It uses a new variant of the scaling technique, called continuous scaling. The main measure of progress is that within a strongly polynomial number of steps, an arc can be identified that must be tight in every dual optimal solution, and thus can be contracted. The full version is available on arXiv:1307.680...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Industrial Engineering Computations
سال: 2012
ISSN: 1923-2926,1923-2934
DOI: 10.5267/j.ijiec.2012.05.006